Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Tolerant Plan Recognition: An Empirical Investigation

Few plan recognition algorithms are designed to tolerate input errors. We describe a case-based plan recognition algorithm (SET-PR) that is robust to two input error types: missing and noisy actions. We extend our earlier work on SET-PR with more extensive evaluations by testing the utility of its novel action-sequence representation for plans and also investigate other design decisions (e.g., ...

متن کامل

Error Tolerant Learning Systems

We consider the task of a robot learning in a reactive environment by performing experiments. A reactive environment is one where changes occur in response to actions. Actors other than the learner may be present in the world. The robot performs experiments by modifying the environment and observing the outcome. These observations lead to a collection of concepts that constitute a theory of the...

متن کامل

Error-Tolerant Agents

The use of agents in today’s Internet world is expanding rapidly. Yet, agent developers proceed largely under the optimistic assumption that agents will be error-free. Errors may arise in agents for numerous reasons — agents may share a workspace with other agents or humans and updates made by these other entities may cause an agent to face a situation that it was not explicitly programmed to d...

متن کامل

Error tolerant Document Structure

Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text documents. The extracted structure is expli-cated by means of SGML (Standard Generalized Markup Language). Consequently, the extraction is achieved on the basis of grammars that extend SGML with recognition rules. From these g...

متن کامل

Error-tolerant Tree Matching

This paper presents an efficient algor i thm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error tolerance. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. The algorithm h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2009

ISSN: 0166-218X

DOI: 10.1016/j.dam.2008.06.004